Generating a network reliability formula by using binary decision diagrams
نویسندگان
چکیده
منابع مشابه
Generating random values using Binary Decision Diagrams and Convex Polyhedra
This article describes algorithms to solve Boolean and numerical constraints, and to randomly select values among the set of solutions. Those algorithms were first designed to generate inputs for testing and simulating reactive real-time programs. As a consequence, the chose a solving technology that allow a fine control in the way solutions are elected. Indeed, a fair selection is sometimes re...
متن کاملBinary Decision Diagrams by Shared
BDDs provide an established technique for propositional formula manipulation. In this paper we re-develop the basic BDD theory using standard rewriting techniques. Since a BDD is a DAG instead of a tree we need a notion of shared rewriting and develop appropriate theory. A rewriting system is presented by which canonical ROBDDs can be obtained. For this rewriting system a layerwise strategy is ...
متن کاملBinary Decision Diagrams on Network of Workstations
The success of all binary decision diagram (BDD) based synthesis and verification algorithms depend on the ability to efficiently manipulate very large BDDs. We present algorithms for manipulation of very large Binary Decision Diagrams (BDDs) on a network of workstations (NOW). A NOW provides a collection of main memories and disks which can be used effectively to create and manipulate very lar...
متن کاملEquational Binary Decision Diagrams Equational Binary Decision Diagrams
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...
متن کاملProgram Analysis Using Binary Decision Diagrams
A fundamental problem in interprocedural program analyses is the need to represent and manipulate collections of large sets. Binary Decision Diagrams (BDDs) are a data structure widely used in model checking to compactly encode large state sets. In this dissertation, we develop new techniques and frameworks for applying BDDs to program analysis, and use our BDD-based analyses to gain new insigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Communications Express
سال: 2015
ISSN: 2187-0136
DOI: 10.1587/comex.4.299